Explicit model predictive control of gas-liquid separation plant via orthogonal search tree partitioning

نویسندگان

  • Alexandra Grancharova
  • Tor Arne Johansen
  • Jus Kocijan
چکیده

Solutions to constrained linear model predictive control (MPC) problems can be pre-computed off-line in an explicit form as a piecewise linear (PWL) state feedback defined on a polyhedral partition of the state space. This admits implementation at high sampling frequencies in real-time systems with high reliability and low software complexity. Recently, algorithms that determine an approximate explicit PWL state feedback solution by imposing an orthogonal search tree structure on the partition, have been developed, and it has been shown that they may offer computational advantages. This paper considers the application of an approximate approach to the design of an explicit model predictive controller for a two-input two-output laboratory gas-liquid separation plant, including experimental evaluation. The approximate explicit MPC controller achieves performance close to that of the conventional MPC, but requires only a fraction of the real-time computational machinery, thus leading to fast and reliable computations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Explicit Model Predictive Control Implemented via Orthogonal Search Tree Partitioning

Solutions to constrained linear model predictive control (MPC) problems can be pre-computed off-line in an explicit form as a piecewise linear (PWL) state feedback defined on a polyhedral partitioning of the state space. Even though real-time optimization is avoided, implementation of the PWL state feedback may still require a significant amount of computations. We suggest an algorithm that wil...

متن کامل

Design of Reduced Dimension Explicit Model Predictive Controller for a Gas-Liquid Separation Plant

Exact or approximate solutions to constrained linear model predictive control (MPC) problems can be precomputed off-line in an explicit form as a piecewise linear state feedback defined on a polyhedral partition of the state space. However, the complexity of the polyhedral partition often increases rapidly with the dimension of the state vector, and the number of constraints. Recently, several ...

متن کامل

Approximate explicit constrained linear model predictive control via orthogonal search tree

Solutions to constrained linear model predictive control problems can be pre-computed off-line in an explicit form as a piecewise linear state feedback on a polyhedral partition of the state space, avoiding real-time optimization. We suggest an algorithm that will determine an approximate explicit piecewise linear state feedback by imposing an orthogonal search tree structure on the partition. ...

متن کامل

Evaluation of piecewise affine control via binary search tree

We present an algorithm for generating a binary search tree that allows efficient evaluation of piecewise affine (PWA) functions defined on a polyhedral partitioning. This is useful for PWA control approaches, such as explicit model predictive control (MPC), as it allows the controller to be implemented online with small computational effort. The computation time is logarithmic in the number of...

متن کامل

Approximate Explicit Model Predictive Control Incorporating Heuristics

Explicit piecewise linear state feedback solutions to the constrained linear model predictive control problem has recently been characterized and computed numerically using multiparametric quadratic programming. The piecewise linear state feedback is defined on a polyhedral partitioning of the state space, which may be quite complex. Here we suggest an approximate multi-parametric quadratic pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Chemical Engineering

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2004